Your selections:
Convex analysis in groups and semigroups: a sampler
- Borwein, Jonathan M., Giladi, Ohad
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Boland, Natashia, Dey, Santanu S., Kalinowski, Thomas, Molinaro, Marco, Rigterink, Fabian
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming
- Boland, Natashia, Dumitrescu, Irina, Froyland, Gary, Kalinowski, Thomas
On the augmented Lagrangian dual for integer programming
- Boland, N. L., Eberhard, A. C.
Applications of convex analysis within mathematics
- Aragón Artacho, Francisco J., Borwein, Jonathan M., Martín-Márquez, Victoria, Yao, Liangjin
Clique-based facets for the precedence constrained knapsack problem
- Boland, Natashia, Bley, Andreas, Fricke, Christopher, Froyland, Gary, Sotirov, Renata
- Borwein, Jonathan M., Hamilton, Chris H.
An outer approximate subdifferential method for piecewise affine optimization
- Neame, Philip, Boland, Natashia, Ralph, Daniel
- Bauschke, Heinz H., Borwein, Jonathan M., Li, Wu
A dual-active-set algorithm for positive semi-definite quadratic programming
On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems
Partially finite convex programming, part I: quasi relative interiors and duality theory
- Borwein, J. M., Lewis, A. S.
Partially finite convex programming, part II: explicit lattice models
- Borwein, J. M., Lewis, A. S.
A simple constraint qualification in infinite dimensional programming
- Borwein, J. M., Wolkowicz, H.
On Fan's minimax theorem
Two kinds of normality in vector optimization
- Borwein, J. M., Nieuwenhuis, J. W.
Are you sure you would like to clear your session, including search history and login status?